Compact Regions for Place/Transition Nets
نویسنده
چکیده
This paper presents compact regions to synthesize a Petri net from a partial language. We synthesize a Petri net using the theory of regions. Let there be a partial language, every region definition provides an inequality system and a solution of this system is called a region. Every region defines a valid place where a place is valid if it enables every word of the partial language. The new compact region definition relies on compact tokenflows. Compact tokenflows are a very efficient behavioral model for the partial language of Petri nets [3, 4]. Compact regions will lead to faster synthesis algorithms computing smaller Petri nets solving the synthesis problem.
منابع مشابه
Theory of Regions for the Synthesis of Inhibitor Nets from Scenarios
In this paper we develop a theory for the region-based synthesis of system models given as place/transition-nets with weighted inhibitor arcs (ptinets) from sets of scenarios describing the non-sequential behaviour. Scenarios are modelled through labelled stratified order structures (LSOs) considering ”earlier than” and ”not later than” relations between events [6, 8] in such a way that concurr...
متن کاملRegions of Affine Nets
Regions of transition systems provide a versatile and effective tool for the synthesis of Petri nets from behavioural specifications. Intuitively, a region captures a single net place through essential behavioural characteristics as encoded in the transition system, including marking information and its connectivity with all the transitions. One of the key advances in the design of region based...
متن کاملRegions of Petri nets with a/sync connections
Automated synthesis from behavioural specifications, is an attractive way of constructing correct concurrent systems. In this paper, we investigate the synthesis of Petri nets which use special connections between transitions and places. Along these a/sync connections tokens can be transferred instantaneously between two transitions executed in a single step. We show that for Place/Transition n...
متن کاملEfficient Reachability Graph Representation of Petri Nets With Unbounded Counters
In this paper, we define a class of Petri nets, called Petri nets with counters, that can be seen as place/transition Petri nets enriched with a vector of integer variables on which linear operations may be applied. Their semantics usually leads to huge or infinite reachability graphs. Then, a more compact representation for this semantics is defined as a symbolic state graph whose nodes possib...
متن کاملRepresenting Place/Transition Nets in Span(Graph)
The compact closed bicategory Span of spans of reeexive graphs is described and it is interpreted as an algebra for constructing speciica-tions of concurrent systems. We describe a procedure for associating to any Place/Transition system an expression in the algebra Span. The value of this expression is a system whose behaviours are the same as those of the P/T system. Furthermore, along the li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015